首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   508篇
  免费   201篇
  国内免费   32篇
  2024年   2篇
  2023年   5篇
  2022年   6篇
  2021年   20篇
  2020年   10篇
  2019年   11篇
  2018年   8篇
  2017年   30篇
  2016年   32篇
  2015年   20篇
  2014年   33篇
  2013年   47篇
  2012年   46篇
  2011年   42篇
  2010年   28篇
  2009年   40篇
  2008年   40篇
  2007年   41篇
  2006年   28篇
  2005年   39篇
  2004年   27篇
  2003年   32篇
  2002年   25篇
  2001年   19篇
  2000年   9篇
  1999年   18篇
  1998年   17篇
  1997年   9篇
  1996年   11篇
  1995年   4篇
  1994年   5篇
  1993年   6篇
  1992年   4篇
  1991年   6篇
  1990年   18篇
  1989年   3篇
排序方式: 共有741条查询结果,搜索用时 265 毫秒
31.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.  相似文献   
32.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
33.
针对现有服务聚合流程建模方法的不足,基于扩展Petri网提出了一种新的服务聚合流程/资源描述模型WSCP/R-net,有效解决了动态服务聚合流程模型中不确定路径选择和服务的动态变化性问题。给出了WSCP/R-net模型向BPEL4WS的转换算法,并以城市应急处理为例说明了转换算法的有效性。  相似文献   
34.
在介绍地形跟随/回避雷达工作原理的基础上,通过设定典型超低空突防飞机的战术行动,分析了对雷达实施有效干扰所必须具备的条件,包括侦察/干扰机的部署、数量要求等;并计算了在传感器/摆放(投掷)式干扰机模式下对装备的性能要求,得出了在目前技术条件下,对地形跟随/回避雷达实施干扰在技术和战术上都是困难的.  相似文献   
35.
以二维碳纤维布和廉价的聚硅氧烷为原料,采用先驱体转化工艺制备2D Cf/Si-O-C材料,对其力学性能进行了考察,并与以聚碳硅烷为先驱体制备的2D Cf/SiC材料在价格和性能方面进行了对比。实验表明,2D Cf/Si-O-C材料力学性能较2D Cf/SiC材料有所下降,但成本大大降低。2D Cf/Si-O-C材料弯曲强度达到157.9 MPa,断裂韧性达到8.4MPa.m1/2,剪切强度达到23.4MPa,并且在1400℃下能较好保持材料的力学性能。  相似文献   
36.
While there has been significant previous literature on inventory transshipment, most research has focused on the dealers' demand filling decision (when to fill transshipment requests from other dealers), ignoring the requesting decision (when to send transshipment requests to other dealers). In this paper we develop optimal inventory transshipment policies that incorporate both types of decisions. We consider a decentralized system in which the dealers are independent of the manufacturer and of each other. We first study a network consisting of a very large number of dealers. We prove that the optimal inventory and transshipment decisions for an individual dealer are controlled by threshold rationing and requesting levels. Then, in order to study the impact of transshipment among independent dealers in a smaller dealer network, we consider a decentralized two‐dealer network and use a game theoretic approach to characterize the equilibrium inventory strategies of the individual dealers. An extensive numerical study highlights the impact of the requesting decision on the dealers' equilibrium behavior in a decentralized setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
37.
基于RTP协议H.264视频流传输QoS保证的研究   总被引:2,自引:0,他引:2  
提出一个Linux环境下基于RTP/RTCP的H.264视频流传输的方案,在Linux中调用V4L(VideofourLinux)的API函数采集视频流,经X264压缩,RTP/RTCP协议打包进行传输。并通过RTCP的RR(接收方报告)包反馈信息和吞吐量公式来计算近似带宽,以起始帧量化参数start-qp为视频编码的调节参数,由近似带宽来控制视频编码的参数调整,达到控制输出码率的目的,实现对视频传输的QoS(QualityofService)保证。  相似文献   
38.
三坐标雷达目标真实高度估计算法研究   总被引:1,自引:0,他引:1  
在目标跟踪领域,通过三坐标雷达的测量值(斜距、仰角及方位角)来估算目标的真实高度一直是个难点。目前主要有两类处理方法:坐标转换法和等效地球半径法。前者把与雷达天线相关的三坐标测量值转换到大地坐标系统来计算目标高度;后者充分考虑地球曲率以及大气折射的特性,通过增加地球半径来估算目标的高度。最后对上述的两类方法进行总结、比较与分析。  相似文献   
39.
针对网络中心发布/订阅系统异步、松散耦合和多对多通信等特点,采用了SOAP消息传递机制对信息进行了封装,从而屏蔽了信息的异构性。考虑到信息传输的可靠性,采用XML-Encryption机制构造SOAP消息,为消息交换和数据传输提供一种安全的保证。实际应用表明该系统在网络中心战中有较好的应用前景。  相似文献   
40.
一种鱼雷辐射噪声的线谱估计方法   总被引:1,自引:0,他引:1  
基于鱼雷辐射噪声的物理特性和线谱特征,探讨了一种鱼雷目标特征提取方法。该方法结合经典谱与现代谱估计,提取水下目标辐射噪声线谱特征。通过两次估计采集数据的功率谱,得到估计算法功率谱图,然后分析功率谱图,先确定线谱存在的大致区域,再估计精确线谱。进行仿真研究,得到了较好的效果,证明该方法对低频段的线谱特征提取有很好的实用性。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号